A uniqueness theorem for edge-chromatic graphs
نویسندگان
چکیده
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملEdge Chromatic 5-Critical Graphs
In this paper, we study the structure of 5-critical graphs in terms of their size. In particular, we have obtained bounds for the number of major vertices in several classes of 5-critical graphs, that are stronger than the existing bounds.
متن کاملVizing’s Theorem and Edge-chromatic Graph Theory
This paper is an expository piece on edge-chromatic graph theory. The central theorem in this subject is that of Vizing. We shall then explore the properties of graphs where Vizing’s upper bound on the chromatic index is tight, and graphs where the lower bound is tight. Finally, we will look at a few generalizations of Vizing’s Theorem, as well as some related conjectures.
متن کاملOn the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles
In this paper, it is shown that the graph obtained by overlapping the cycle and the complete tripartite graph at an edge is uniquely determined by its chromatic polynomial. ) 3 ( ≥ m Cm 2 , 2 , 2 K Let G be a finite graph with neither loops nor multiple edges and let ) ; ( λ G P denote its chromatic polynomial. Then G is said to be chromatically unique if ) ; ( ) ; ( λ λ G Y P = implies that Y ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1967
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1967.21.503